The knowledge related to the methodology of the field TRIAL study as a type of intervention studies, yet for many of our researchers is not fully understood. The aim of the current study was a better understanding of conducting this type of research. Field TRIAL studies are done on healthy individuals and aim to prevent. These types of studies such as clinical TRIALs are performed on both individual and collective levels. One type of these studies is Community Intervention TRIAL which is usually done on a large scale population. Field TRIAL study should be carried out in stages, such as the formulation of hypotheses, selection of the population (reference population, study population, and sampling), measuring the baseline variables (before conducting preventive intervention), random allocation of subjects to intervention and control groups, doing interventions and measuring outcome. The methodology of field TRIAL studies is very similar to clinical TRIALs. The difference is that field TRIALs are conducted on healthy individuals and aim to prevent and also the sample size required to this type of study is relatively more, and these studies are usually time consuming and costly.

Reasonable and common time and costs of civil litigation and EFFICIENT litigation advocacy (TRIAL) process are called the quality TRIAL that make an optimum flow (procedure) of TRIAL and its efficiency. Quality of TRIAL, which is one of the fundamental guarantees in a civil TRIAL system, emphasizes on effective organizing of legal relations litigants and judicial apparatus, therefore, meanwhile the social function of TRIAL is promoted, the substantial justice (=EFFICIENT justice) will be also achieved.In this paper, first of all, the concept of EFFICIENT TRIAL and quality of justice is discussed and then respectively, the position and indicators for quality of TRIAL are noted, finally, it is focused on counting and explaining the promoting of quality TRIAL factors.

Due to the stochastic nature of wind energy, allocating an appropriate investment incentive for wind generation technology (WGT) is a complicated issue. We propose an improvement on the traditional incentive, known as capacity payment mechanism (CPM), to reward the wind generators based on their performance exogenously affected by the wind energy potential of the location where the turbines are installed, and therefore, lead the investments towards locations with more generation potential. In CPM, a part of investment cost of each generator is recovered through fixed payments. However, in our proposal, wind generators are rewarded according to dynamic forecasts of the wind energy potential of the wind farm where they are located. We use an auto-regressive moving average (ARMA) model to forecast the wind speed fluctuations in long-term while capturing the auto-correlation of wind velocity variation in consecutive time intervals. Using the system dynamics (SD) modelling approach a competitive electricity market is designed to examine the efficiency of the proposed incentive. Performing a simulation analysis, we conclude that while a fixed CPM for wind generation can decrease the loss of load durations and average prices in long-term, the proposed improvement can provide quite similar results more EFFICIENTly.

With the increasing number of vehicles worldwide and the advancement of technology, intelligent transportation systems have emerged as a key solution for traffic control and road safety enhancement. One of the crucial components of these systems is vehicle type recognition. In this paper, a combination of EFFICIENTNet-B0 and YOLO-V11 models is used for vehicle type classification. In this model, EFFICIENTNet-B0 serves as the backbone of YOLO-V11, extracting image features and feeding them into the YOLO model to accurately determine the location and type of vehicles. To evaluate the performance of the proposed model, the BVMMR image dataset—containing over 5,000 of various Iranian vehicles—was utilized. The model was implemented using Python and executed in the Colab online environment. The results demonstrate that the proposed model achieves a mean Average Precision at 50% IoU (mAP50) of 99.3% and a mean Average Precision across IoU thresholds from 50% to 95% (mAP50-95) of 98.3%. Additionally, in terms of processing speed, the model delivers an EFFICIENT performance with an images average preprocessing time of 0.2 milliseconds, inference time of 2.8 milliseconds, and post-processing time of 2.5 milliseconds per image.

Background and Aim: It is of special importance to consider disinfection principles for next use or all types of reusable TRIAL contact lenses; in order to prevent of transferring infectious agents from one patient to another. The aim of this research was to study the rate of observing disinfecting principles forreusable color contact lens TRIAL sets by the practitioners in the optometry and ophthalmology offices and private eye clinics in Tehran.Materials and Methods: In this observational cross-sectional study, 42 eye centers ( including 3 private eye clinics, 14 ophthalmology offices and 25 optometry offices) in Tehran using reusable color contact lens TRIAL sets to present color contact lenses were checked. Samplings were made randomly from the surface of color contact lenses TRIAL set (totally 65 samples obtained). Samples were cultured in standard laboratory conditions and the data were analyzed statistically for “Ratio Comparison Test”; using SPSS software (version 19).Results: In some samples, one type and in some others two types of microorganisms were grown concurrently. In 81.5% of the samples, the bacterial contamination including Escherichia coli, Pseudomonas aeruginosa, Citrobacter, Klebsiella, Proteus, Diphtheroids, and Macrococcus was observed and in 18.5% of the samples, no bacterial contamination was found.Conclusion: Based on the findings, it seems that the present method in using reusable color contact lens TRIAL sets may not be a suitable method.

Data envelopment analysis (DEA) helps the managers to separate and classify the e cient and ine cient units in a homogenous group. DEA is a set of methods inferred from mathematics and other sciences in which the branch of unit ranking can be signi cantly e ective in improving managerial decisions. Although this branch in DEA is considered still young, it has proved its ability in solving some problems like production planning, resource allocation, inventory control, etc. The managers who care about their results quality cannot be indi erent to units ranking. In this article, to rank the units which are under-evaluated,  rstly the decision-making unit (DMU) is removed from the production possibility set (PPS), and then the new PPS is produced. The unit under evaluation is inside or outside of the new PPS. Therefore, to benchmark the under-evaluation DMU to new frontiers, two models are solved. If the removed unit is outside of the new PPS, the  rst model is feasible, and the second model is infeasible. If the removed unit is inside or on the frontier of the new PPS, both models are feasible. The method presented in this article for ranking the under-evaluation units has these characteristics: 1-this model can distinguish extreme and non-extreme e cient units and ine cient units. 2-Also, the presented models for ranking DMUs can be changed into a linear model. 3-This method shows stability in changing small or near-zero data. 4-It does not assign a false ranking. The presented methods in this article are able to distinguish the set of extreme and non-extreme e cient and ine cient units as well as being able to overcome the common problems in ranking. In this article, suggested models are introduced in 3. 1 which are able to rank all under evaluation units except non-extreme e cient units, this problem is solved in 3. 2, in other words in 3. 2 all DMUs are ranked.

Although discriminating between all EFFICIENT decision making units (DMUs) with identical efficiency is a very important subject in data envelopment analysis (DEA), it may not be an easy task, particularly when the decision maker wants to select one and only one EFFICIENT DMU among all. There are some papers that have proposed methods for finding an EFFICIENT DMU as the most EFFICIENT one but have some difficulties when used in practice. This paper points out the difficulties of the methods presented in two articles [Amin, G. R., (2009). Comments on finding the most EFFICIENT DMUs in DEA: An improved integrated model. Computers and IndusTRIAL Engineering 56, 1701-1702; Toloo, M., Nalchigar, S., (2009). A new integrated DEA model for finding most BCC-EFFICIENT DMU. Applied Mathematical Modelling, 33, 597-604]. In fact, in the present paper, it is proved by some examples that although some methods have principally been proposed in order to determine a single EFFICIENT DMU as the most EFFICIENT one, they may be unable to detect these DMUs.

With the present effort, we propose to investigate results of applying the Right-Truncated Index-Based Web Search Engine in order to determine its usefulness for storing and retrieving Arabic documents. The Right-Truncated Index-Based Web Search Engine, being a program for reading any set of Arabic documents accepts a query, and then processes both the documents and the query. Thus, it selects (predicts) those documents most relevant to the query which has been inserted. The program encompasses both a morphological component and a mathematical one. The morphological component allows the researcher to run either a stemming algorithm or a right-truncated algorithm. The chief advantage of the stemming algorithm is that it uses the least possible amount of storage for indexing by mapping the inflected and derived terms into a single, indexed-stem word. On the other hand, the right-truncated algorithm reduces the amount of storage to a lesser degree, but increases the probability of retrieving relevant (user-favorable) documents, compared to the stemming algorithm. One of the purposes of our investigation is to compare the efficiency of these two indexing mechanisms. The mathematical component of the algorithm accepts the output of the right truncation algorithm, and then employs both term-frequency and inverse document-frequency (TF-IDF) in order to establish the relative importance of each document, respective to the terms of the query. This paper also describes building a simple search engine based on a crawler or a spider. The clawer which indexes different types of documents is an algorithm to crawl the file systems from specified folder. A basic design and object model was developed to support single search word results as well as multiple search words results. It is capable of finding data to index by following (tracing) web links rather than searching directory listings in the file system. In this process files are downloaded through HTTP and HTML pages parsed in order to obtain more links without getting into a recursive loop. Also, this paper discusses how to improve indexing mechanism efficiency using a right truncated stemmer in terms of Arabic documents processing.